Update Summarization Based on Co-Ranking with Constraints

نویسنده

  • Xiaojun Wan
چکیده

Update summarization is an emerging summarization task of creating a short summary of a set of news articles, under the assumption that the user has already read a given set of earlier articles. In this paper, we propose a new co-ranking method to address the update summarization task. The proposed method integrates two co-ranking processes by adding strict constraints. In comparison with the original co-ranking method, the proposed method can compute more accurate scores of sentences for the purpose of update summarization. Evaluation results on the most recent TAC2011 dataset demonstrate that our proposed method can outperform the original co-ranking method and other baselines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WHUSUM: Wuhan University at the Update Summarization Task of TAC 2009

This paper describes the system WHUSUM we developed to participate in the update summarization task of TAC 2009. Given a topic and corresponding topic statement, this year's task is to write 2 summaries (one for Document Set A and one for Document Set B) that meet the information need expressed in the topic statement. In order to generate a topic-oriented summary for Set A, We present a co-trai...

متن کامل

TMSP: Topic Guided Manifold Ranking with Sink Points for Guided Summarization

Guided summarization is an extension of query-focused multidocument summarization. We proposed a novel ranking algorithm, Topic Guided Manifold Ranking with Sink Points (TMSP) for guided summarization tasks of TAC2010. TMSP is a topic extended version of Manifold Ranking with Sink Points (MRSP), which handles the Update Summarization tasks of TAC2009 well. We adopt the TMSP and MRSP methods to ...

متن کامل

PNR2: Ranking Sentences with Positive and Negative Reinforcement for Query-Oriented Update Summarization

Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate the important and query-relevant information, but also to capture the new information when document collections evolve. In this paper, we propose a novel graph based sentence ranking algorithm, namely PNR, for update sum...

متن کامل

Query-focused Supervised Sentence Ranking for Update Summaries

We present a supervised sentence ranking approach for use in extractive update summarization. We use the same general machine learning approach described in earlier DUC papers, and adapt it to the update summarization task. The system proves adaptable enough to be effective at queryfocused update summaries.

متن کامل

Graph-Based Marginal Ranking for Update Summarization

Update summarization is to summarize a document collection B given that the users have already read another document collection A, which has time stamp prior to that of B. An important and challenging issue in update summarization is that contents in B already covered by A should be excluded from the update summary. In this paper, we propose a graphbased regularization framework MarginRank for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012